Lecture 2 — October 19 2.1.1 Matrix Games
نویسنده
چکیده
2.1.1 matrix games A 2-player zero-sum game, or a matrix game, is defined by a matrix A ∈ Rm×n, called the payoff matrix. There are two players with opposing interests: the row player (minimizer) and the column player (maximizer). At each step of the play, the row player selects a row i, and the column player selects a column j, then the row player pays to the column player the value aij of the (i, j)th entry in the matrix. Suppose that the play continues forever, how to play such a game?
منابع مشابه
Optimal Control and Variational Methods Lecture Notes Prof . Dan Cobb
2 Finite-Dimensional Optimization 5 2.1 Background . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.1.1 Euclidean Spaces . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 5 2.1.2 Norms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 6 2.1.3 Matrix Norms . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ...
متن کاملCS364A: Algorithmic Game Theory Lecture #19: Pure Nash Equilibria and PLS-Completeness∗
1 The Big Picture We now have an impressive list of tractability results — polynomial-time algorithms and quickly converging learning dynamics — for several equilibrium concepts in several classes of games. Such tractability results, especially via reasonably natural learning processes, lend credibility to the predictive power of these equilibrium concepts. See also Figure 1. [Lecture 17] In ge...
متن کاملPreconditioned Conjugate Gradient
.. ................................................................................................................... ix Chapter 1. Introduction ..................................................................................................1 Chapter 2. Background ..................................................................................................6 2.1. Matrix Compu...
متن کاملGame Theory Lecture
A two person zerosum game is of the form 〈{1, 2}, S1, S2, u1,−u1〉. Note that when a player tries to maximize her payoff, she is also simultaneously minimizing payoff of the other player. For this reason, these games are also called strictly competitive games. Player 1 is usually called the row player and player 2 is called the column player . Let S1 = {s11, s12, . . . , s1m} and S2 = {s21, s22,...
متن کاملNash Equilibrium Strategy for Bi-matrix Games with L-R Fuzzy Payoffs
In this paper, bi-matrix games are investigated based on L-R fuzzy variables. Also, based on the fuzzy max order several models in non-symmetrical L-R fuzzy environment is constructed and the existence condition of Nash equilibrium strategies of the fuzzy bi-matrix games is proposed. At last, based on the Nash equilibrium of crisp parametric bi-matrix games, we obtain the Pareto and weak Pareto...
متن کامل